Storage capacity of a constructive learning algorithm
نویسندگان
چکیده
منابع مشابه
A Constructive Learning Algorithm for an HME
A Hierarchical Mixtures of Experts (HME) model has been applied to several classes of problems, and its usefulness has been shown. However, defining an adequate structure in advance is required and the resulting performance depends on the structure. To overcome this problem, a constructive learning algorithm for an HME is proposed; it includes an initialization method, a training method and an ...
متن کاملA ug 2 00 0 Storage Capacity of the Tilinglike Learning Algorithm
The storage capacity of an incremental learning algorithm for the parity machine, the Tilinglike Learning Algorithm, is analytically determined in the limit of a large number of hidden perceptrons. Different learning rules for the simple perceptron are investigated. The usual Gardner-Derrida one leads to a storage capacity close to the upper bound, which is independent of the learning algorithm...
متن کاملOptimisation of Circuits Using a Constructive Learning Algorithm
The paper presents an application of a constructive learning algorithm to optimisation of circuits. For a given Boolean function f, a fresh constructive learning algorithm builds circuits belonging to the smallest Fn, m class of functions (n inputs and having m groups of ones in their truth table). The constructive proofs, which show how arbitrary Boolean functions can be implemented by this al...
متن کاملA High-Storage Capacity Content-Addressable Memory and Its Learning Algorithm
Abstrud -Hopfield’s neural networks show retrieval and speed capabilities that make them good candidates for content-addressable memories (CAM’s) in problems such as pattern recognition and optimization. This paper presents a new implementation of a VLSI fully interconnected neural network with only two binary memory points per synapse (the connection weights are restricted to three different v...
متن کاملA Constructive Learning Algorithm for Discriminant Tangent Models
To reduce the computational complexity of classification systems using tangent distance, Hastie et al. (HSS) developed an algorithm to devise rich models for representing large subsets of the data which computes automatically the "best" associated tangent subspace. Schwenk & Milgram proposed a discriminant modular classification system (Diabolo) based on several autoassociative multilayer perce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 2000
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/33/9/301